An Iteratively Decodable Tensor Product Code with Application to Data Storage
نویسندگان
چکیده
منابع مشابه
New Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada
Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...
متن کاملA tensor product approach to the abstract partial fourier transforms over semi-direct product groups
In this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the Fourier transform. As a consequence, we extend the fundamental theorems of Abelian Fourier transform to non-Abelian case.
متن کاملAn Application-Aware Data Storage Model
We describe a new application-controlled le persistence model in which applications select the desired stability from a range of persistence guarantees. This new abstraction extends conventional abstractions by allowing applications to specify a le's volatility and methods for automatic reconstruction in case of loss. The model allows applications, particularly ones with weak persistence requir...
متن کاملWindow Network Data Envelopment Analysis: An Application to Investment Companies
In this study, the window network data envelopment analysis (WNDEA) model will be proposed, that is capable to be used in the presence of panel data. Additionally, the proposed model is applied to evaluate the dynamic efficiency of 5 investment companies in Tehran stock exchange during the period from 2013 to 2017.
متن کاملFast Hankel tensor-vector product and its application to exponential data fitting
This paper is contributed to a fast algorithm for Hankel tensor–vector products. First, we explain the necessity of fast algorithms for Hankel and block Hankel tensor–vector products by sketching the algorithm for both one-dimensional and multi-dimensional exponential data fitting. For proposing the fast algorithm, we define and investigate a special class of Hankel tensors that can be diagonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2010
ISSN: 0733-8716
DOI: 10.1109/jsac.2010.100212